SIMD Implementation of the Aho-Corasick Algorithm using Intel AVX2
نویسندگان
چکیده
منابع مشابه
An Efficient Linear Pseudo-minimization Algorithm for Aho-Corasick Automata
A classical construction of Aho and Corasick solves the pattern matching problem for a finite set of words X in linear time, where the size of the input X is the sum of the lengths of its elements. It produces an automaton that recognizes A∗X, where A is a finite alphabet, but which is generally not minimal. As an alternative to classical minimization algorithms, which yields a O(n logn) soluti...
متن کاملImplementation of the DWT using Intel IA-32 SIMD Extensions
This paper presents some results on the implementation of the DWT (DWT) trough the lifting scheme by using general purpose processor SIMD extensions. We perform image analysis and reconstruction up to 3 levels of decomposition, using the DWT factored into lifting steps for the 9/7 wavelet filter pair. The algorithm was implemented in “C” code and evaluated in terms of performance and image degr...
متن کاملImplementing the Aho-Corasick Automata for Phonetic Search
In phonetic search, the goal is to find in a text all words with the same pronunciation as the search phrase. The user writes the word down using a different alphabet and transcription rules. Mrázová et al. proposed a new method for phonetic search based on searching for all possible transcriptions with Aho-Corasick automata [8]. Their algorithm offers better precision than the previous existin...
متن کاملExploring SIMD for Molecular Dynamics, Using Intel
We analyse gather-scatter performance bottlenecks in molecular dynamics codes and the challenges that they pose for obtaining benefits from SIMD execution. This analysis informs a number of novel code-level and algorithmic improvements to Sandia’s miniMD benchmark, which we demonstrate using three SIMD widths (128-, 256and 512bit). The applicability of these optimisations to wider SIMD is discu...
متن کاملThe Extension of The Aho-Corasick Algorithm to Multiple Rectangular Patterns of Different Sizes and N-Dimensional Patterns and Text
The p a t t e r n matching problem i s t o f i n d a l l occurrences of a p a t t e r n i n a t e x t , o r t o decide tha t no such pattern exis ts i n the text. An e f f i c ien t algorithm was proposed by Boyer and Moore [ 1 I. Unlike t h e KnuthMorris-Pratt a lgor i thm [ 2 I and the 'bruteforce' algorithm, the Boyer-Moore algorithm compares the pattern with the t ex t from the r i g h t en...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scalable Computing: Practice and Experience
سال: 2019
ISSN: 1895-1767
DOI: 10.12694/scpe.v20i3.1572